Covering a cubic graph by 5 perfect matchings
نویسنده
چکیده
Berge Conjecture states that every bridgeless cubic graph has 5 perfect matchings such that each edge is contained in at least one of them. In this paper, we show that Berge Conjecture holds for two classes of cubic graphs, cubic graphs with a circuit missing only one vertex and bridgeless cubic graphs with a 2-factor consisting of two circuits. The first part of this result implies that Berge Conjecture holds for hypohamiltonian cubic graphs. MSC 2010: 05C70
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملOn Fulkerson conjecture
If G is a bridgeless cubic graph, Fulkerson conjectured that we can find 6 perfect matchings (a Fulkerson covering) with the property that every edge of G is contained in exactly two of them. A consequence of the Fulkerson conjecture would be that every bridgeless cubic graph has 3 perfect matchings with empty intersection (this problem is known as the Fan Raspaud Conjecture). A FR-triple is a ...
متن کاملOn Perfect Matching Coverings and Even Subgraph Coverings
A perfect matching covering of a graph G is a set of perfect matchings of G such that every edge of G is contained in at least one member of it. Berge conjectured that every bridgeless cubic graph admits a perfect matching covering of order at most 5 (we call such a collection of perfect matchings a Berge covering of G). A cubic graph G is called a Kotzig graph if G has a 3-edge-coloring such t...
متن کاملUnions of perfect matchings in cubic graphs
We show that any cubic bridgeless graph with m edges contains two perfect matchings that cover at least 3m/5 edges, and three perfect matchings that cover at least 27m/35 edges.
متن کاملOn the perfect matching index of bridgeless cubic graphs
If G is a bridgeless cubic graph, Fulkerson conjectured that we can find 6 perfect matchings M1, . . . ,M6 of G with the property that every edge of G is contained in exactly two of them and Berge conjectured that its edge set can be covered by 5 perfect matchings. We define τ(G) as the least number of perfect matchings allowing to cover the edge set of a bridgeless cubic graph and we study thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 340 شماره
صفحات -
تاریخ انتشار 2017